Trellis coded modulation to improve dirty paper trellis watermarking
نویسندگان
چکیده
Lattice codes and quantization-based techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in volume of a song, or re-quantization, e.g. JPEG compression. Hence, it is reasonable to investigate alternative codes which may offer the potential for superior performance. In previous work, we designed a new class of codes, called dirty paper trellis codes (DPTC), which are by construction immune to valuemetric scaling. Although DPTC have shown themselves to be resistant to certain classes attacks, the trellises were generated randomly, thus leading to suboptimal codes. In this paper, Ungerboeck’s work on trellis coded modulation (TCM) is exploited to significantly improve the performance of the DPTC. Experimental results show that the resulting trellises significantly outperform the original design.
منابع مشابه
STEGANOGRAPHY AND DIGITAL WATERMARKING Improving the performance of RDM watermarking by means of trellis coded quantisation
We propose a method to improve the performance of the recently introduced rational dither modulation (RDM) watermarking scheme. The improvement is obtained by modifying the essentially scalar nature of RDM with the introduction of a vector quantiser. The vector quantiser is based on a properly modified version of classical trellis coded quantisation, thus leading to the new trellis-coded RDM sc...
متن کاملA Practical Dirty Paper Coding Applicable for Broadcast Channel
In this paper, we present a practical dirty paper coding scheme using trellis coded modulation for the dirty paper channel Y = X+S+W, E{X} ≤ P , where W is white Gaussian noise with power σ w, P is the average transmit power and S is the Gaussian interference with power σ s that is non-causally known at the transmitter. We ensure that the dirt in our scheme remains distinguishable to the receiv...
متن کاملA novel embedding technique for dirty paper trellis codes watermarking
→ Security weakness (Kerckhoffs's framework). Code book estimable on a simplified version [2]. → High computational complexity of the Embedding part Lin et al. [3] solution is not enough satisfying in term of robustness-distortion tradeoff. → DCT artifacts. [1] “Applying Informed Coding and Informed Embedding to Design a Robust, High Capacity Watermark”, Miller, Doërr, and Cox, IEEE TIP 2004. [...
متن کاملFast Embedding Technique for Dirty Paper Trellis Watermarking
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate watermarking schemes. Nevertheless, recent researches reveal its security weakness. Previously, we proposed to reinforce its security by using a secret space before the embedding. This secret space requires to compute...
متن کاملJoint Data Hiding and Wyner-Ziv Coding, Theory and Practice
This paper considers the joint problem of dirty-paper and Wyner-Ziv coding with partial host information at the receiver. The rate-distortion and the capacity expressions have been derived for the Gaussian case. It is shown that the availability of the partial host information to the receiver has positive effects to the compression performance and the overall capacity. Moreover, a practical cod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007